全文获取类型
收费全文 | 2485篇 |
免费 | 175篇 |
国内免费 | 99篇 |
专业分类
化学 | 259篇 |
晶体学 | 2篇 |
力学 | 4篇 |
综合类 | 30篇 |
数学 | 2363篇 |
物理学 | 101篇 |
出版年
2024年 | 2篇 |
2023年 | 50篇 |
2022年 | 64篇 |
2021年 | 48篇 |
2020年 | 103篇 |
2019年 | 99篇 |
2018年 | 92篇 |
2017年 | 87篇 |
2016年 | 66篇 |
2015年 | 54篇 |
2014年 | 90篇 |
2013年 | 227篇 |
2012年 | 73篇 |
2011年 | 137篇 |
2010年 | 135篇 |
2009年 | 240篇 |
2008年 | 191篇 |
2007年 | 146篇 |
2006年 | 154篇 |
2005年 | 94篇 |
2004年 | 87篇 |
2003年 | 110篇 |
2002年 | 69篇 |
2001年 | 49篇 |
2000年 | 45篇 |
1999年 | 27篇 |
1998年 | 27篇 |
1997年 | 25篇 |
1996年 | 25篇 |
1995年 | 8篇 |
1994年 | 15篇 |
1993年 | 16篇 |
1992年 | 12篇 |
1991年 | 12篇 |
1990年 | 13篇 |
1989年 | 13篇 |
1988年 | 10篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 12篇 |
1984年 | 11篇 |
1983年 | 3篇 |
1982年 | 5篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有2759条查询结果,搜索用时 15 毫秒
91.
Liejin Zhou Xingxing Wu Xing Yang Chengli Mou Runjiang Song Shuyan Yu Huifang Chai Lutai Pan Zhichao Jin Yonggui Robin Chi 《Angewandte Chemie (International ed. in English)》2020,59(4):1557-1561
The combined use of gold as transition metal catalyst and N‐heterocyclic carbene (NHC) as organic catalyst in the same solution for relay catalytic reactions was disclosed. The ynamide substrate was activated by gold catalyst to form unsaturated ketimine intermediate that subsequently reacted with the enals (via azolium enolate intermediate generated with NHC) effectively to form bicyclic lactam products with excellent diastereo‐ and enantio‐selectivities. The gold and NHC coordination and dissociation can be dynamic and tunable events, and thus allow the co‐existence of both active metal and carbene organic catalysts in appreciable concentrations, for the dual catalytic reaction to proceed. 相似文献
92.
The 2-dimensional BF theory is both a gauge theory and a topological Poisson σ-model corresponding to a linear Poisson bracket. In [3], Torossian discovered a connection which governs correlation functions of the BF theory with sources for the B-field. This connection is flat, and it is a close relative of the KZ connection in the WZW model. In this Letter, we show that flatness of the Torossian connection follows from (properly regularized) quantum equations of motion of the BF theory. 相似文献
93.
A solvent effect in the reaction of diazomethane with norbornane-2,3-dione 3-hemiketal in various aprotic solvents such as ether, dichloromethane, tetrahydrofuran (THF), dioxane, and chloroform is reported. Unlike in methanol, preparatively useful quantities of oxetane derivatives were obtained along with a novel hexahydro-1H-cyclopenta[c]furan-1-one in these aprotic solvents. Dichloromethane and THF gave optimal yields of the two products. In some cases, α-ketoketals were formed as minor products along with the aforementioned products. Interestingly, TMSCHN2 furnished hexahydro-1H-cyclopenta[c]furan-1-one as the predominant product. 相似文献
94.
Agelos Georgakopoulos 《Advances in Mathematics》2009,220(3):670-967
We prove Diestel's conjecture that the square G2 of a 2-connected locally finite graph G has a Hamilton circle, a homeomorphic copy of the complex unit circle S1 in the Freudenthal compactification of G2. 相似文献
95.
Let G be a graph. If u,v∈V(G), a u-vshortest path of G is a path linking u and v with minimum number of edges. The closed interval I[u,v] consists of all vertices lying in some u-v shortest path of G. For S⊆V(G), the set I[S] is the union of all sets I[u,v] for u,v∈S. We say that S is a convex set if I[S]=S. The convex hull of S, denoted Ih[S], is the smallest convex set containing S. A set S is a hull set of G if Ih[S]=V(G). The cardinality of a minimum hull set of G is the hull number of G, denoted by hn(G). In this work we prove that deciding whether hn(G)≤k is NP-complete.We also present polynomial-time algorithms for computing hn(G) when G is a unit interval graph, a cograph or a split graph. 相似文献
96.
A graph G is said to be determined by its Q-spectrum if with respect to the signless Laplacian matrix Q, any graph having the same spectrum as G is isomorphic to G. The lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex of a path Pn−p. In this paper, it is proved that all lollipop graphs are determined by their Q-spectra. 相似文献
97.
We give a complete characterization of on-line arbitrarily vertex decomposable graphs in the family of unicycle graphs called suns. A sun is a graph with maximum degree three, such that deleting vertices of degree one results in a cycle. This result has already been used in another paper to prove some Ore-type conditions for on-line arbitrarily decomposable graphs. 相似文献
98.
We study the low energy asymptotics of periodic and random Laplace operators on Cayley graphs of amenable, finitely generated groups. For the periodic operator the asymptotics is characterised by the van Hove exponent or zeroth Novikov–Shubin invariant. The random model we consider is given in terms of an adjacency Laplacian on site or edge percolation subgraphs of the Cayley graph. The asymptotic behaviour of the spectral distribution is exponential, characterised by the Lifshitz exponent. We show that for the adjacency Laplacian the two invariants/exponents coincide. The result holds also for more general symmetric transition operators. For combinatorial Laplacians one has a different universal behaviour of the low energy asymptotics of the spectral distribution function, which can be actually established on quasi-transitive graphs without an amenability assumption. The latter result holds also for long range bond percolation models. 相似文献
99.
A graph G is k-choosable if every vertex of G can be properly colored whenever every vertex has a list of at least k available colors. Grötzsch’s theorem [4] states that every planar triangle-free graph is 3-colorable. However, Voigt [M. Voigt, A not 3-choosable planar graph without 3-cycles, Discrete Math. 146 (1995) 325-328] gave an example of such a graph that is not 3-choosable, thus Grötzsch’s theorem does not generalize naturally to choosability. We prove that every planar triangle-free graph without 7- and 8-cycles is 3-choosable. 相似文献
100.
Super edge-connectivity of mixed Cayley graph 总被引:1,自引:0,他引:1
A graph X is max-λ if λ(X)=δ(X). A graph X is super-λ if X is max-λ and every minimum edge-cut set of X isolates one vertex. In this paper, we proved that for all but a few exceptions, the mixed Cayley graph which is defined as a new kind of semi-regular graph is max-λ and super-λ. 相似文献